A complete axiomatization of a theory with feature and arity constraints
Identifieur interne : 00C658 ( Main/Exploration ); précédent : 00C657; suivant : 00C659A complete axiomatization of a theory with feature and arity constraints
Auteurs : Rolf Backofen [Allemagne]Source :
- The Journal of Logic Programming [ 0743-1066 ] ; 1995.
English descriptors
- Teeft :
- Access function, Algorithm, Arity, Arity constraint, Arity constraints, Atomic formula, Atomic formulae, Axiom, Axiom scheme, Axiom schemes, Axiomatization, Backofen, Basic constraint, Basic simplification rules, Boolean, Boolean combination, Closure, Complete axiomatization, Complete theory, Completeness, Completeness proof, Computational linguistics, Computer science, Concrete example, Concurrent constraint programming, Constant symbol, Constraint, Decidable, Determinant, Elementarily equivalent, Equivalence transformations, Existential quantification, Existentially, Feature constraint, Feature constraints, Feature description, Feature descriptions, Feature structures, Feature tree, Feature trees, Finite trees, Free variables, Graph constraint, Hcft, Infinite signature, Infinite trees, Innermost quantifier, Logic programming, Ncft, Normal form, Normalizer, Other hand, Path constraint, Path constraints, Predicate, Predicate logic, Prime formula, Prime formulae, Proc, Proper path constraint, Quantifier, Quantifier elimination, Research report dfki, Same constraints, Simplification, Simplification algorithm, Simplification system, Smolka, Sort constraints, Special case, Standard model, Subtree, Symbolic computation, Theoretical comput, Tree domain, Unary predicate, Undecided, Undecided variables.
Abstract
Abstract: CFT is a recent constraint system providing records as a logical data structure for logic programming and for natural language processing. It combines the rational tree system as defined for logic programming with the feature tree system as used in natural language processing. The formulae considered in this paper are all first-order logic formulae over a signature of binary and unary predicates called features and arities, respectively. We establish the theory CFT by means of seven axiom schemes and show its completeness. Our completeness proof exhibits a terminating simplification system deciding the validity and satisfiability of possibly quantified record descriptions.
Url:
DOI: 10.1016/0743-1066(95)00033-G
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000B74
- to stream Istex, to step Curation: 000B67
- to stream Istex, to step Checkpoint: 002A73
- to stream Main, to step Merge: 00CF15
- to stream Main, to step Curation: 00C658
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>A complete axiomatization of a theory with feature and arity constraints</title><author><name sortKey="Backofen, Rolf" sort="Backofen, Rolf" uniqKey="Backofen R" first="Rolf" last="Backofen">Rolf Backofen</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:3218724F6F2A1F3F56CC7554C0D0A1F048ACA6A6</idno><date when="1995" year="1995">1995</date><idno type="doi">10.1016/0743-1066(95)00033-G</idno><idno type="url">https://api.istex.fr/ark:/67375/6H6-XMJHM94D-G/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000B74</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000B74</idno><idno type="wicri:Area/Istex/Curation">000B67</idno><idno type="wicri:Area/Istex/Checkpoint">002A73</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002A73</idno><idno type="wicri:doubleKey">0743-1066:1995:Backofen R:a:complete:axiomatization</idno><idno type="wicri:Area/Main/Merge">00CF15</idno><idno type="wicri:Area/Main/Curation">00C658</idno><idno type="wicri:Area/Main/Exploration">00C658</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">A complete axiomatization of a theory with feature and arity constraints</title><author><name sortKey="Backofen, Rolf" sort="Backofen, Rolf" uniqKey="Backofen R" first="Rolf" last="Backofen">Rolf Backofen</name><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Deutsches Forschungszentrum für Künstliche Intelligenz (DFKI), Stuhlsatzenhausweg 3, 66123 Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation></author></analytic><monogr></monogr><series><title level="j">The Journal of Logic Programming</title><title level="j" type="abbrev">JLP</title><idno type="ISSN">0743-1066</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1995">1995</date><biblScope unit="volume">24</biblScope><biblScope unit="issue">1–2</biblScope><biblScope unit="page" from="37">37</biblScope><biblScope unit="page" to="71">71</biblScope></imprint><idno type="ISSN">0743-1066</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0743-1066</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Access function</term><term>Algorithm</term><term>Arity</term><term>Arity constraint</term><term>Arity constraints</term><term>Atomic formula</term><term>Atomic formulae</term><term>Axiom</term><term>Axiom scheme</term><term>Axiom schemes</term><term>Axiomatization</term><term>Backofen</term><term>Basic constraint</term><term>Basic simplification rules</term><term>Boolean</term><term>Boolean combination</term><term>Closure</term><term>Complete axiomatization</term><term>Complete theory</term><term>Completeness</term><term>Completeness proof</term><term>Computational linguistics</term><term>Computer science</term><term>Concrete example</term><term>Concurrent constraint programming</term><term>Constant symbol</term><term>Constraint</term><term>Decidable</term><term>Determinant</term><term>Elementarily equivalent</term><term>Equivalence transformations</term><term>Existential quantification</term><term>Existentially</term><term>Feature constraint</term><term>Feature constraints</term><term>Feature description</term><term>Feature descriptions</term><term>Feature structures</term><term>Feature tree</term><term>Feature trees</term><term>Finite trees</term><term>Free variables</term><term>Graph constraint</term><term>Hcft</term><term>Infinite signature</term><term>Infinite trees</term><term>Innermost quantifier</term><term>Logic programming</term><term>Ncft</term><term>Normal form</term><term>Normalizer</term><term>Other hand</term><term>Path constraint</term><term>Path constraints</term><term>Predicate</term><term>Predicate logic</term><term>Prime formula</term><term>Prime formulae</term><term>Proc</term><term>Proper path constraint</term><term>Quantifier</term><term>Quantifier elimination</term><term>Research report dfki</term><term>Same constraints</term><term>Simplification</term><term>Simplification algorithm</term><term>Simplification system</term><term>Smolka</term><term>Sort constraints</term><term>Special case</term><term>Standard model</term><term>Subtree</term><term>Symbolic computation</term><term>Theoretical comput</term><term>Tree domain</term><term>Unary predicate</term><term>Undecided</term><term>Undecided variables</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: CFT is a recent constraint system providing records as a logical data structure for logic programming and for natural language processing. It combines the rational tree system as defined for logic programming with the feature tree system as used in natural language processing. The formulae considered in this paper are all first-order logic formulae over a signature of binary and unary predicates called features and arities, respectively. We establish the theory CFT by means of seven axiom schemes and show its completeness. Our completeness proof exhibits a terminating simplification system deciding the validity and satisfiability of possibly quantified record descriptions.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Sarre (Land)</li></region><settlement><li>Sarrebruck</li></settlement></list><tree><country name="Allemagne"><noRegion><name sortKey="Backofen, Rolf" sort="Backofen, Rolf" uniqKey="Backofen R" first="Rolf" last="Backofen">Rolf Backofen</name></noRegion><name sortKey="Backofen, Rolf" sort="Backofen, Rolf" uniqKey="Backofen R" first="Rolf" last="Backofen">Rolf Backofen</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C658 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00C658 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:3218724F6F2A1F3F56CC7554C0D0A1F048ACA6A6
|texte= A complete axiomatization of a theory with feature and arity constraints
}}
| This area was generated with Dilib version V0.6.33. |  |